The effect of removing a 2-downer edge or a cut 2-downer edge triangle for an eigenvalue

نویسندگان

چکیده

Abstract Edges in the graph associated with a square matrix over field may be classified as to how their removal affects multiplicity of an identified eigenvalue. There are five possibilities: + 2 +2 (2-Parter); 1 +1 (Parter); no change (neutral); − -1 (downer); and -2 (2-downer). Especially, it is known that 2-downer edges for eigenvalue comprise cycles graph. We investigate effect statuses other or vertices by removing edge. Then, we cut edge triangle.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2

The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...

متن کامل

The edge tenacity of a split graph

The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...

متن کامل

The effect of the angle upper edge in shaped noise barriers with a T-shaped upper edge

Background and Objective: Efforts to improve the effectiveness of noise barriers have been made, including shape, aesthetics, form and gender. Therefore, the aim of this study was to investigate the effect of the angle upper edge in shaped noise barriers with a T-shaped upper edge. Materials and Methods: A 2D boundary element method (BEM) was used to predict the insertion loss of the tested ba...

متن کامل

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs

In this article, we introduce and study the properties of some target graphs for 2-edge-colored homomorphism. Using these properties, we obtain in particular that the 2-edge-colored chromatic number of the class of triangle-free planar graphs is at most 50. We also show that it is at least 12. C © 2016 Wiley Periodicals, Inc. J. Graph Theory 00: 1–20, 2016

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Special Matrices

سال: 2023

ISSN: ['2300-7451']

DOI: https://doi.org/10.1515/spma-2022-0186